A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
Identifieur interne : 003131 ( Main/Exploration ); précédent : 003130; suivant : 003132A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
Auteurs : Gerold J Ger [Allemagne] ; Weixiong Zhang [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been made on the HCP in undirected graphs, little is known for the HCP in directed graphs (DHCP). The contribution of this work is an effective algorithm for the DHCP. Our algorithm explores and exploits the close relationship between the DHCP and the Assignment Problem (AP) and utilizes a technique based on Boolean satisfiability (SAT). By combining effective algorithms for the AP and SAT, our algorithm significantly outperforms previous exact DHCP algorithms including an algorithm based on the award-winning Concorde TSP algorithm.
Url:
DOI: 10.1007/978-3-642-13182-0_20
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003860
- to stream Istex, to step Curation: 003817
- to stream Istex, to step Checkpoint: 000893
- to stream Main, to step Merge: 003188
- to stream Main, to step Curation: 003131
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem</title><author><name sortKey="J Ger, Gerold" sort="J Ger, Gerold" uniqKey="J Ger G" first="Gerold" last="J Ger">Gerold J Ger</name></author><author><name sortKey="Zhang, Weixiong" sort="Zhang, Weixiong" uniqKey="Zhang W" first="Weixiong" last="Zhang">Weixiong Zhang</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:EC88B15F44967A4B153C7ACF16DC7D2CDA25E5EC</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1007/978-3-642-13182-0_20</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-JP3P0B3H-F/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003860</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003860</idno><idno type="wicri:Area/Istex/Curation">003817</idno><idno type="wicri:Area/Istex/Checkpoint">000893</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000893</idno><idno type="wicri:doubleKey">0302-9743:2010:J Ger G:a:sat:based</idno><idno type="wicri:Area/Main/Merge">003188</idno><idno type="wicri:Area/Main/Curation">003131</idno><idno type="wicri:Area/Main/Exploration">003131</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem</title><author><name sortKey="J Ger, Gerold" sort="J Ger, Gerold" uniqKey="J Ger G" first="Gerold" last="J Ger">Gerold J Ger</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Computer Science Institute, Christian-Albrechts-University of Kiel, D-24118, Kiel</wicri:regionArea><placeName><region type="land" nuts="2">Schleswig-Holstein</region><settlement type="city">Kiel</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Zhang, Weixiong" sort="Zhang, Weixiong" uniqKey="Zhang W" first="Weixiong" last="Zhang">Weixiong Zhang</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science/Department of Genetics, Washington University, 63130-4899, St. Louis, Missouri</wicri:regionArea><placeName><region type="state">Missouri (État)</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been made on the HCP in undirected graphs, little is known for the HCP in directed graphs (DHCP). The contribution of this work is an effective algorithm for the DHCP. Our algorithm explores and exploits the close relationship between the DHCP and the Assignment Problem (AP) and utilizes a technique based on Boolean satisfiability (SAT). By combining effective algorithms for the AP and SAT, our algorithm significantly outperforms previous exact DHCP algorithms including an algorithm based on the award-winning Concorde TSP algorithm.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>États-Unis</li></country><region><li>Missouri (État)</li><li>Schleswig-Holstein</li></region><settlement><li>Kiel</li></settlement></list><tree><country name="Allemagne"><region name="Schleswig-Holstein"><name sortKey="J Ger, Gerold" sort="J Ger, Gerold" uniqKey="J Ger G" first="Gerold" last="J Ger">Gerold J Ger</name></region><name sortKey="J Ger, Gerold" sort="J Ger, Gerold" uniqKey="J Ger G" first="Gerold" last="J Ger">Gerold J Ger</name></country><country name="États-Unis"><region name="Missouri (État)"><name sortKey="Zhang, Weixiong" sort="Zhang, Weixiong" uniqKey="Zhang W" first="Weixiong" last="Zhang">Weixiong Zhang</name></region><name sortKey="Zhang, Weixiong" sort="Zhang, Weixiong" uniqKey="Zhang W" first="Weixiong" last="Zhang">Weixiong Zhang</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003131 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 003131 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:EC88B15F44967A4B153C7ACF16DC7D2CDA25E5EC
|texte= A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
}}
| This area was generated with Dilib version V0.6.33. |  |